已被证明在改善神经电机翻译（NMT）系统方面有效的深度编码器，但是当编码器层数超过18时，它达到了翻译质量的上限。更糟糕的是，更深的网络消耗了很多内存，使其无法实现有效地训练。在本文中，我们呈现了共生网络，其包括完整的网络作为共生主网络（M-Net）和另一个具有相同结构的共享子网，但层数较少为共生子网（S-Net）。我们在变压器深度（M-N）架构上采用共生网络，并在NMT中定义M-Net和S-Net之间的特定正则化损耗$ \ mathcal {l} _ {\ tau} $。我们对共生网络进行联合培训，并旨在提高M净性能。我们拟议的培训策略在CMT'14 en-> De，De-> EN和EN-> FR任务的经典培训下将变压器深（12-6）改善了0.61,0.49和0.69 BLEU。此外，我们的变压器深（12-6）甚至优于经典变压器深度（18-6）。

最近，非自动增加（NAT）模型并行地预测输出，与自回归（AT）模型相比，实现了产生速度的大量改进。在对原始数据上表现更差的同时，大多数NAT模型都被培训为在教师模型生成的蒸馏数据上的学生模型，称为序列级知识蒸馏。提高模型性能的有效培训策略是自蒸馏混合（SDM）培训，预先训练原始数据模型，通过预先训练的模型本身产生蒸馏数据，最后重新列举模型原始数据和蒸馏数据的组合。在这项工作中，我们的目标是查看NAT模型的SDM，但发现直接采用SDM到NAT模型在翻译质量方面没有改进。通过仔细分析，我们观察失效与教师模型与NAT学生模型的建模和确认偏差相关。基于这些发现，我们提出了一种增强的策略，通过向经典SDM添加两个阶段来提高名为SDMRT的策略：一个是在自蒸馏数据上进行预重磅，另一个是对滤波后的教师蒸馏数据进行微调。我们的结果在多个NAT模型上以0.6至1.2 bleu表示基础。作为另一个奖励，对于迭代细化NAT模型，我们的方法可以在半迭代号内倾斜基线，这意味着2x加速度。

自回归（AR）和非自动增加（NAR）模型对性能和延迟具有自己的优势，将它们与一个模型相结合，可能会利用两者。目前的组合框架更多地关注多个解码范例的集成，具有统一的生成模型，例如，屏蔽语言模型。然而，由于训练目标和推理之间的差距，概括可能对性能有害。在本文中，我们的目标是通过在统一框架下保留AR和NAR的原始目标来缩小差距。具体地，我们通过将AR和NAR共同建模（左右，左右和直）与新引入的方向变量来提出定向变压器（Diformer），这通过控制每个的预测令牌在那方面有特定的依赖关系。通过方向实现的统一成功地保留了AR和NAR中使用的原始依赖性假设，保留了泛化和性能。 4 WMT基准测试的实验表明，Diformer优于当前的联合建模工作，适用于AR和NAR解码的1.5个以上的BLEU积分，也对最先进的独立AR和NAR模型具有竞争力。

根据目标的语义信息，减少抓取检测的范围对于提高抓取检测模型的准确性并扩大其应用。研究人员一直在尝试将这些能力与端到端网络中的这些功能相结合，以有效地掌握杂乱场景中的特定对象。在本文中，我们提出了一种端到端语义抓握检测模型，可以实现语义识别和掌握检测。我们还设计了一个目标要素过滤机制，其仅根据用于抓取检测的语义信息维护单个对象的特征。该方法有效地减少了与目标对象弱相关的背景特征，从而使得具有更独特的功能并保证抓取检测的准确性和效率。实验结果表明，该方法在康奈尔抓地数据集中可以实现98.38％的精度，我们对不同数据集或评估度量的结果显示了我们对最先进的方法的域适应性。

Masked image modeling (MIM) performs strongly in pre-training large vision Transformers (ViTs). However, small models that are critical for real-world applications cannot or only marginally benefit from this pre-training approach. In this paper, we explore distillation techniques to transfer the success of large MIM-based pre-trained models to smaller ones. We systematically study different options in the distillation framework, including distilling targets, losses, input, network regularization, sequential distillation, etc, revealing that: 1) Distilling token relations is more effective than CLS token- and feature-based distillation; 2) An intermediate layer of the teacher network as target perform better than that using the last layer when the depth of the student mismatches that of the teacher; 3) Weak regularization is preferred; etc. With these findings, we achieve significant fine-tuning accuracy improvements over the scratch MIM pre-training on ImageNet-1K classification, using all the ViT-Tiny, ViT-Small, and ViT-base models, with +4.2%/+2.4%/+1.4% gains, respectively. Our TinyMIM model of base size achieves 52.2 mIoU in AE20K semantic segmentation, which is +4.1 higher than the MAE baseline. Our TinyMIM model of tiny size achieves 79.6% top-1 accuracy on ImageNet-1K image classification, which sets a new record for small vision models of the same size and computation budget. This strong performance suggests an alternative way for developing small vision Transformer models, that is, by exploring better training methods rather than introducing inductive biases into architectures as in most previous works. Code is available at https://github.com/OliverRensu/TinyMIM.

Given the increasingly intricate forms of partial differential equations (PDEs) in physics and related fields, computationally solving PDEs without analytic solutions inevitably suffers from the trade-off between accuracy and efficiency. Recent advances in neural operators, a kind of mesh-independent neural-network-based PDE solvers, have suggested the dawn of overcoming this challenge. In this emerging direction, Koopman neural operator (KNO) is a representative demonstration and outperforms other state-of-the-art alternatives in terms of accuracy and efficiency. Here we present KoopmanLab, a self-contained and user-friendly PyTorch module of the Koopman neural operator family for solving partial differential equations. Beyond the original version of KNO, we develop multiple new variants of KNO based on different neural network architectures to improve the general applicability of our module. These variants are validated by mesh-independent and long-term prediction experiments implemented on representative PDEs (e.g., the Navier-Stokes equation and the Bateman-Burgers equation) and ERA5 (i.e., one of the largest high-resolution data sets of global-scale climate fields). These demonstrations suggest the potential of KoopmanLab to be considered in diverse applications of partial differential equations.

In this chapter, we review and discuss the transformation of AI technology in HCI/UX work and assess how AI technology will change how we do the work. We first discuss how AI can be used to enhance the result of user research and design evaluation. We then discuss how AI technology can be used to enhance HCI/UX design. Finally, we discuss how AI-enabled capabilities can improve UX when users interact with computing systems, applications, and services.

Adversarial robustness assessment for video recognition models has raised concerns owing to their wide applications on safety-critical tasks. Compared with images, videos have much high dimension, which brings huge computational costs when generating adversarial videos. This is especially serious for the query-based black-box attacks where gradient estimation for the threat models is usually utilized, and high dimensions will lead to a large number of queries. To mitigate this issue, we propose to simultaneously eliminate the temporal and spatial redundancy within the video to achieve an effective and efficient gradient estimation on the reduced searching space, and thus query number could decrease. To implement this idea, we design the novel Adversarial spatial-temporal Focus (AstFocus) attack on videos, which performs attacks on the simultaneously focused key frames and key regions from the inter-frames and intra-frames in the video. AstFocus attack is based on the cooperative Multi-Agent Reinforcement Learning (MARL) framework. One agent is responsible for selecting key frames, and another agent is responsible for selecting key regions. These two agents are jointly trained by the common rewards received from the black-box threat models to perform a cooperative prediction. By continuously querying, the reduced searching space composed of key frames and key regions is becoming precise, and the whole query number becomes less than that on the original video. Extensive experiments on four mainstream video recognition models and three widely used action recognition datasets demonstrate that the proposed AstFocus attack outperforms the SOTA methods, which is prevenient in fooling rate, query number, time, and perturbation magnitude at the same.

Reading comprehension of legal text can be a particularly challenging task due to the length and complexity of legal clauses and a shortage of expert-annotated datasets. To address this challenge, we introduce the Merger Agreement Understanding Dataset (MAUD), an expert-annotated reading comprehension dataset based on the American Bar Association's 2021 Public Target Deal Points Study, with over 39,000 examples and over 47,000 total annotations. Our fine-tuned Transformer baselines show promising results, with models performing well above random on most questions. However, on a large subset of questions, there is still room for significant improvement. As the only expert-annotated merger agreement dataset, MAUD is valuable as a benchmark for both the legal profession and the NLP community.

Rankings are widely collected in various real-life scenarios, leading to the leakage of personal information such as users' preferences on videos or news. To protect rankings, existing works mainly develop privacy protection on a single ranking within a set of ranking or pairwise comparisons of a ranking under the $\epsilon$-differential privacy. This paper proposes a novel notion called $\epsilon$-ranking differential privacy for protecting ranks. We establish the connection between the Mallows model (Mallows, 1957) and the proposed $\epsilon$-ranking differential privacy. This allows us to develop a multistage ranking algorithm to generate synthetic rankings while satisfying the developed $\epsilon$-ranking differential privacy. Theoretical results regarding the utility of synthetic rankings in the downstream tasks, including the inference attack and the personalized ranking tasks, are established. For the inference attack, we quantify how $\epsilon$ affects the estimation of the true ranking based on synthetic rankings. For the personalized ranking task, we consider varying privacy preferences among users and quantify how their privacy preferences affect the consistency in estimating the optimal ranking function. Extensive numerical experiments are carried out to verify the theoretical results and demonstrate the effectiveness of the proposed synthetic ranking algorithm.